Enhancing the Data Collection to Reduced Interference in Tree Based Ad-Hoc Sensor Network

In the wireless sensor networks the energy of the nodes present in the network is limited. Due to the low manufacturing costs of sensor nodes, they can be deployed in large numbers and having more challenges in routing, topology and data management protocols. These challenges are complicated by severe energy constraints and the inherently unreliable nature of wireless communications which have yielded work in increasing network efficiency. What is the fastest rate at which we can collect a stream of aggregated data from a set of wireless sensors organized as a tree? We explore a hierarchy of techniques using realistic simulation models to address this question. We begin by considering TDMA scheduling on a single channel, reducing the original problem to minimizing the number of time slots needed to schedule each link of the aggregation tree. The second technique is to combine the scheduling with transmission power control to reduce the effects of interference. To better cope with interference, we then study the impact of utilizing multiple frequency channels by introducing a simple receiver-based frequency and time scheduling approach. We find that for networks of about a hundred nodes, the use of multi-frequency scheduling can suffice to eliminate most of the interference. The data collection rate then becomes limited not by interference, but by the maximum degree of the routing tree. Therefore we consider finally how the data collection rate can be further enhanced by the use of degree-constrained routing trees. Considering deployments at different densities, we show that these enhancements can improve the streaming aggregated data collection by as much as 10 times compared to the baseline of singlechannel data collection over non-degree constrained routing trees. Addition to our primary conclusion, in the frequency scheduling domain we evaluate the impact of different interference models on the scheduling performance and give topologyspecific bounds on time slot and frequency channel requirements.